On codes with the locality property
نویسندگان
چکیده
We consider codes that support the local recovery property of each code symbol (LRC codes). Codes of this type were extensively studied in recent years because of their applications in distributed storage systems. We discuss algebraic constructions of LRC codes over small alphabets that attain the best possible distance-locality tradeoff and their extensions to cyclic codes and codes on algebraic curves. We also discuss examples of practical LRC codes used in large-scale storage systems and point out some open questions in this area.
منابع مشابه
Some Constructions for Fractional Repetition Codes with Locality 2
In this paper, we examine the locality property of the original Fractional Repetition(FR) codes and propose two constructions for FR codes with better locality. For this, we first derive the capacity of the FR codes with locality 2, that is the maximum size of the file that can be stored. Construction 1 generates an FR code with repetition degree 2 and locality 2. This code is optimal in the se...
متن کاملLinear Locally Repairable Codes with Random Matrices
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find...
متن کاملCyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Trans. Inform. Theory, no. 8, 2014). In this paper we focus on optimal cyclic codes that arise from this construction. We give a characterization...
متن کاملLocally Repairable Codes with Unequal Locality Requirements
When a node in a distributed storage system fails, it needs to be promptly repaired to maintain system integrity. While typical erasure codes can provide a significant storage advantage over replication, they suffer from poor repair efficiency. Locally repairable codes (LRCs) tackle this issue by reducing the number of nodes participating in the repair process (locality), with the cost of reduc...
متن کاملOn taking advantage of multiple requests in error correcting codes
In most notions of locality in error correcting codes—notably locally recoverable codes (LRCs) and locally decodable codes (LDCs)—a decoder seeks to learn a single symbol of a message while looking at only a few symbols of the corresponding codeword. However, suppose that one wants to recover r > 1 symbols of the message. The two extremes are repeating the single-query algorithm r times (this i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016